Secrecy Rate of Cooperative MIMO in Presence of a Location Constrained Eavesdropper

نویسندگان

  • Zhong Zheng
  • Zygmunt Haas
  • Mario Kieburg
چکیده

We propose and study the secrecy cooperative MIMO architecture to enable and to improve the secrecy transmissions between clusters of mobile devices in presence of an eavesdropper with certain location constraint. The cooperative MIMO is formed by temporarily activating clusters of nearby trusted devices, with each cluster being centrally coordinated by its corresponding cluster head. We assume that the transmitters apply a practical eigen-direction precoding scheme and that the eavesdropper has multiple possible locations in the proximity of the legitimate devices. We first obtain the expression of the secrecy rate, where the required average mutual information between the transmit cluster and the eavesdropper is characterized by closed-form approximations. The proposed approximations are especially useful in the secrecy rate maximization, where the original non-convex problem is approximated by a sequence of convex sub-problems. Numerical results show that the achievable secrecy rate can be effectively improved by activating equal or larger number of trusted devices as compared to the number of antennas at the eavesdropper. The secrecy rate is further improved by increasing the cluster size.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MIMO Wiretap Channels with Arbitrarily Varying Eavesdropper Channel States

In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wire...

متن کامل

The Secrecy Capacity of the 2× 2 MIMO Wiretap Channel

We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is achieved when the the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that the eavesdropper gets zero bits of informat...

متن کامل

Beam domain secure transmission for massive MIMO communications

We investigate the optimality and power allocation algorithm of beam domain transmission for single-cell massive multiple-input multiple-output (MIMO) systems with a multiantenna passive eavesdropper. Focusing on the secure massive MIMO downlink transmission with only statistical channel state information of legitimate users and the eavesdropper at base station, we introduce a lower bound on th...

متن کامل

Opportunistic relay selection for cooperative networks with secrecy constraints

This study deals with opportunistic relay selection in cooperative networks with secrecy constraints, where an eavesdropper node tries to overhead the source message. Previously reported relay selection techniques are optimised for non-eavesdropper environments and cannot ensure security. Two new opportunistic relay selection techniques, which incorporate the quality of the relay-eavesdropper l...

متن کامل

On the Optimal Precoding for MIMO Gaussian Wire-Tap Channels

We consider the problem of finding secrecy rate of a multiple-input multiple-output (MIMO) wire-tap channel. A transmitter, a legitimate receiver, and an eavesdropper are all equipped with multiple antennas. The channel states from the transmitter to the legitimate user and to the eavesdropper are assumed to be known at the transmitter. In this contribution, we address the problem of finding th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017